A Hitchhiker's Guide to descriptional complexity through analytic combinatorics

An Introduction to Descriptional Complexity of Regular Languages through Analytic Combinatorics

Nowadays, an increasing attention is being given to the study of the descriptional complexity on the average case. Although the underlying theory for such a study seems intimidating, one can obtain interesting results in this area without too much effort. In this gentle introduction we take the reader on a journey through the basic analytical tools of that theory, giving some illustrative examp...

The Hitchhikers' Guide to Google

The web is big. Really big. This is good because the Web now encompasses the entire history, culture, science, and achievements of the human race, not to mention JPEGs of every romantically eligible member of that race under the age of 35. This is bad because it is now too big to find anything. The ‘Hitch-Hikers Guide to Google’ is a collection of patterns that will be your guide through the In...

Analytic Combinatorics — Symbolic Combinatorics

This booklet develops in nearly 200 pages the basics of combinatorial enumeration through an approach that revolves around generating functions. The major objects of interest here are words, trees, graphs, and permutations, which surface recurrently in all areas of discrete mathematics. The text presents the core of the theory with chapters on unlabelled enumeration and ordinary generating func...

An Invitation to Analytic Combinatorics

ANALYTIC COMBINATORICS is primarily a book about combinatorics, that is, the study of finite structures built according to a finite set of rules. Analytic in the title means that we concern ourselves with methods from mathematical analysis, in particular complex and asymptotic analysis. The two fields, combinatorial enumeration and complex analysis, are organized into a coherent set of methods ...

Analytic Combinatorics